Linear Solvability in the Viewing Graph
نویسندگان
چکیده
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices form a family that we call the Solution Set. This paper provides a theoretical framework that formalizes different properties of the topology, linear solvability and number of solutions of multi-camera systems. We systematically characterize the topology of the Viewing Graph in terms of its solution set by means of the associated algebraic bilinear system. Based on this characterization, we provide conditions about the linearity and the number of solutions and define an inductively constructible set of topologies which admit a unique linear solution. Camera matrices can thus be retrieved efficiently and large viewing graphs can be handled in a recursive fashion. The results apply to problems such as the projective reconstruction from multiple views or the calibration of camera networks.
منابع مشابه
SOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES
In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...
متن کاملNumerical solvability of system of Fredholm-Hammerstein integral equations using Modification of Hat Function
A system of integral equations can describe different kind of problems in sciences and engineering. There are many different methods for numerical solution of linear and nonlinear system of integral equations. This paper proposed a numerical method based on modification of Hat functions for solving system of Fredholm-Hammerstein integral equations. The proposed method reduced a system of integr...
متن کاملA note on unique solvability of the absolute value equation
It is proved that applying sufficient regularity conditions to the interval matrix $[A-|B|,A + |B|]$, we can create a new unique solvability condition for the absolute value equation $Ax + B|x|=b$, since regularity of interval matrices implies unique solvability of their corresponding absolute value equation. This condition is formulated in terms of positive deniteness of a certain point matrix...
متن کاملOn the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملLinear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets
In Part I, we studied linear network coding over finite commutative rings and made comparisons to the wellstudied case of linear network coding over finite fields. Here, we consider the more general setting of linear network coding over finite (possibly non-commutative) rings and modules. We prove the following results regarding the linear solvability of directed acyclic networks over various f...
متن کامل